Sublinearly Space Bounded Iterative Arrays
نویسندگان
چکیده
Iterative arntys (lAs) are a, parallel computational model with a, sequential processing of the input. They are one-dimensional arrays of interacting identical deterministic finite automata. In this note, realtime-lAs with sublinear space bounds are used to accept formal languages. The existence of a proper hierarchy of space complexity classes between logarithmic anel linear space bounds is proved. Furthermore, an optimal spacc lower bound for non-regular language recognition is shown.
منابع مشابه
Richardson and Chebyshev Iterative Methods by Using G-frames
In this paper, we design some iterative schemes for solving operator equation $ Lu=f $, where $ L:Hrightarrow H $ is a bounded, invertible and self-adjoint operator on a separable Hilbert space $ H $. In this concern, Richardson and Chebyshev iterative methods are two outstanding as well as long-standing ones. They can be implemented in different ways via different concepts.In this paper...
متن کاملConvergence theorems of multi-step iterative algorithm with errors for generalized asymptotically quasi-nonexpansive mappings in Banach spaces
The purpose of this paper is to study and give the necessary andsufficient condition of strong convergence of the multi-step iterative algorithmwith errors for a finite family of generalized asymptotically quasi-nonexpansivemappings to converge to common fixed points in Banach spaces. Our resultsextend and improve some recent results in the literature (see, e.g. [2, 3, 5, 6, 7, 8,11, 14, 19]).
متن کاملBounded Suboptimal Search in Linear Space: New Results
Bounded suboptimal search algorithms are usually faster than optimal ones, but they can still run out of memory on large problems. This paper makes three contributions. First, we show how solution length estimates, used by the current stateof-the-art linear-space bounded suboptimal search algorithm Iterative Deepening EES, can be used to improve unboundedspace suboptimal search. Second, we conv...
متن کاملPhase Only Synthesis of Antenna Patterns Using Iterative Restoration Methods
In this work, the method of iterative Fourier transform phase reconstruction, conventionally used in holography and optical image reconstruction, is applied to phase only synthesis of antenna patterns. The method is applied to two types of pattern synthesis problems: "main lobe beam shaping" and "side-lobe-level reduction". The proposed method is most useful in the efficient employment of attai...
متن کاملFixed point theorem for non-self mappings and its applications in the modular space
In this paper, based on [A. Razani, V. Rako$check{c}$evi$acute{c}$ and Z. Goodarzi, Nonself mappings in modular spaces and common fixed point theorems, Cent. Eur. J. Math. 2 (2010) 357-366.] a fixed point theorem for non-self contraction mapping $T$ in the modular space $X_rho$ is presented. Moreover, we study a new version of Krasnoseleskii's fixed point theorem for $S+T$, where $T$ is a cont...
متن کامل